Transitive Mesh Space of a Progressive Mesh

نویسندگان

  • Junho Kim
  • Seungyong Lee
چکیده

This paper investigates the set of all selectively refined meshes that can be obtained from a progressive mesh. We call the set the transitive mesh space of a progressive mesh and present a theoretical analysis of the space. We define selective edge collapse and vertex split transformations, which we use to traverse all selectively refined meshes in the transitive mesh space. We propose a complete selective refinement scheme for a progressive mesh based on the transformations and compare the scheme with previous selective refinement schemes in both theoretical and experimental ways. In our comparison, we show that the complete scheme always generates selectively refined meshes with smaller numbers of vertices and faces than previous schemes for a given refinement criterion. The concept of dual pieces of the vertices in the vertex hierarchy plays a central role in the analysis of the transitive mesh space and the design of selective edge collapse and vertex split transformations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Highly Symmetric and Congruently Tiled Meshes for Shells and Domes

We describe the generation of all possible shell and dome shapes that can be uniquely meshed (tiled) using a single type of mesh face (tile), and following a single meshing (tiling) rule that governs the mesh (tile) arrangement with maximal vertex, edge and face symmetries. Such tiling arrangements or congruently tiled meshed shapes, are frequently found in chemical forms (fullerenes or Bucky b...

متن کامل

Introduction to the Slide Modeling Method for the Efficient Solution of Heat Conduction Calculations

Determination of the maximum temperature and its location is the matter of the greatest importance in many technological and scientific engineering applications. In terms of numerical calculations of the heat conduction equation by using uniform mesh increments in space, large computational cost is sometimes countered. However, adaptive grid refinement method could be computationally efficient ...

متن کامل

Single Step Undirected Reconfigurable Networks

Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconngurable bus systems. In this work we have shown a general construction so that a T steps rn-mesh of size n n can be simulated by a single step rn-mesh, where the corresponding mesh size increase by a factor of n O(T). The construction itself is simpler and smaller as compared to a ...

متن کامل

A mesh generation procedure to simulate bimaterials

It is difficult to develop an algorithm which is able to generate the appropriate mesh around the interfaces in bimaterials. In this study, a corresponding algorithm is proposed for this class of unified structures made from different materials with arbitrary shapes. The non-uniform mesh is generated adaptively based on advancing front technique available in Abaqus software. Implementing severa...

متن کامل

Mobile 3D graphics compression for progressive transmission

With the evolution of mobile communication networks, three-dimensional graphics applications and services are fast developing fields in mobile graphics and wireless networks. While the data size of 3D meshes is increasing, the available bandwidth of wireless networks and the weak resources of mobile devices have become relatively limited. The transmission of graphics multimedia over wireless ne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Vis. Comput. Graph.

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2003